Ergodic Computations with Continued Fractions and Jacobi ' s Algorithm

نویسنده

  • W. A. Beyer
چکیده

Ergodic computational aspects of the Jacobi algorithm, a generalization to two dimensions of the continued fraction algorithm, are considered. By means of such computations the entropy of the algorithm is estimated to be 3.5. An approximation to the, invariant measure of the transformation associated with the algorithm is obtained. The computations are tested by application to the continued fraction algorithm for which both entropy and the invariant measure are known.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

S - adic expansions related to continued fractions

We consider S-adic expansions associated with continued fraction algorithms, where an S-adic expansion corresponds to an infinite composition of substitutions. Recall that a substitution is a morphism of the free monoid. We focus in particular on the substitutions associated with regular continued fractions (Sturmian substitutions), and with Arnoux–Rauzy, Brun, and Jacobi–Perron (multidimension...

متن کامل

Beta-continued Fractions over Laurent Series

The present paper is devoted to a new notion of continued fractions in the field of Laurent series over a finite field. The definition of this kind of continued fraction algorithm is based on a general notion of number systems. We will prove some ergodic properties and compute the Hausdorff dimensions of bounded type continued fraction sets.

متن کامل

Arithmetic distributions of convergents arising from Jacobi-Perron algorithm

We study the distribution modulo m of the convergents associated with the d-dimensional Jacobi-Perron algorithm for a.e. real numbers in (0, 1) by proving the ergodicity of a skew product of the Jacobi-Perron transformation; this skew product was initially introdued in [6] for regular continued fractions.

متن کامل

Some aspects of multidimensional continued fraction algorithms

Many kinds of algorithms of continued fraction expansions of dimension s(≥ 2) have been studied starting with K.G.J.Jacobi(1804-1851), for example, see [14]. For s = 1, we know Lagrange’s theorem related to periodic continued fractions and real quadratic irrationals. But, even for real cubic irrationalities, there appeared no suitable algorithms (of dimension 2). In this section, we roughly exp...

متن کامل

Periodic Jacobi-Perron expansions associated with a unit

We prove that, for any unit in a real number fieldK of degree n+ 1, there exits only a finite number of n-tuples in K which have a purely periodic expansion by the Jacobi-Perron algorithm. This generalizes the case of continued fractions for n = 1. For n = 2 we give an explicit algorithm to compute all these pairs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1972